منابع مشابه
c ○ 2006 Society for Industrial and Applied Mathematics CYCLE DECOMPOSITIONS OF Kn,n − I ∗
Let Kn,n denote the complete bipartite graph with n vertices in each bipartition set and Kn,n − I denote Kn,n with a 1-factor removed. An m-cycle system of Kn,n − I is a collection T of m-cycles such that each edge of Kn,n − I is contained in a unique m-cycle of T . In this paper, it is proved that the necessary and sufficient conditions for the existence of an m-cycle system of Kn,n − I are n ...
متن کاملDecompositions of Km, n and Kn into cubes
We consider the decomposition of the complete bipartite graph K'm,n into isomorphic copies of a d-cube. We present some general necessary conditions for such a decomposition and show that these conditions are sufficient for d 3 and d = 4. We also explore the d-cube decomposition of the complete graph Kn. Necessary and sufficient conditions for the existence of such a decomposition are known for...
متن کامل5-cycle Decompositions from Paired 3- and 4-cycle Decompositions
Let (V, T ) be a 3-fold triple system and (V,C) a 4-fold 4-cycle system on the same set V . This choice of indices 3 and 4 ensures that each system contains the same number of cycles: |T | = |C|. We pair up the cycles, {t, c}, where t ∈ T and c ∈ C, in such a way that t and c share one edge. If t = (x, y, z) and c = (x, y, u, v), so t and c share the edge {x, y}, then we retain the 5-cycle (z, ...
متن کاملPath And Cycle Decompositions
First I want to say a few words about my graph terminology. If I want to allow loops, I use the adjective reflexive. If I want to allow multiple edges, I use multigraph. Thus, a graph has no loops and no multiple edges. I use valency rather than degree. If we say a graph is 4-valent (or tetravalent), it means it is regular of valency 4, for example. A decomposition of a graph X is a partition o...
متن کاملPlanar Decompositions and Cycle Constraints
Dual-decomposition methods for optimization have emerged as an extremely powerful tool for solving combinatorial problems in graphical models. These techniques can be thought of as decomposing a complex model into a collection of easier-to-solve components, providing a variational bound which can then be optimized over its parameters. A wide variety of algorithms have been proposed, often disti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2001
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1996